Hashing into Hessian curves
نویسندگان
چکیده
منابع مشابه
Hashing into Hessian Curves
We describe a hashing function from the elements of the finite field Fq into points on a Hessian curve. Our function features the uniform and smaller size for the cardinalities of almost all fibers compared with the other known hashing functions for elliptic curves. Moreover, a point on the image set of the function is uniquely given by its abscissa. For ordinary Hessian curves, the cardinality...
متن کاملOn hashing into elliptic curves
We study the hash function from a finite field Fq into an elliptic curve over Fq which has recently been introduced by T. Icart. In particular we slightly adjust and prove the conjectured T. Icart asymptotic formula for the image size of this function.
متن کاملHashing into Generalized Huff Curves
Huff curves are well known for efficient arithmetics to their group law. In this paper, we propose two deterministic encodings from Fq to generalized Huff curves. When q ≡ 3 (mod 4), the first deterministic encoding based on Skalpa’s equality saves three field squarings and five multiplications compared with birational equivalence composed with Ulas’ encoding. It costs three multiplications les...
متن کاملVerified Indifferentiable Hashing into Elliptic Curves
Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain (e.g. bitstrings) onto uniformly and independently distributed points in a curve. When implementing such systems, and in order for the proof to carry over to the implementation, those mappings must be instantiated with co...
متن کاملEfficient Indifferentiable Hashing into Ordinary Elliptic Curves
We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. While almost as efficient as Icart’s encoding, this hash function can be plugged into any cryptosystem that requires hashing into elliptic curves, while not compromising proofs of security in the random oracle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Cryptography
سال: 2014
ISSN: 1753-0563,1753-0571
DOI: 10.1504/ijact.2014.062737